Bounded Repairability for Regular Tree Languages
نویسندگان
چکیده
منابع مشابه
Bounded repairability of word languages
What do you do if a computational object (e.g. program trace) fails a specification? An obvious approach is to perform a repair : modify the object minimally to get something that satisfies the constraints. This approach has been investigated in the database community, for integrity constraints, and in the AI community for propositional logics. Here we study how difficult it is to repair a docu...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملOgden's Lemma for Regular Tree Languages
Pumping lemmata are elementary tools for the analysis of formal languages. While they usually cannot be made strong enough to fully capture a class of languages, it is generally desirable to have as strong pumping lemmata as possible. However, this is counterbalanced by the experience that strong pumping lemmata may be hard to prove, or, worse, hard to use—this experience has been made, for exa...
متن کاملBidirectional Optimality for Regular Tree Languages
Optimality theory (OT henceforth) has been introduced by Prince and Smolensky (1993) originally as a model for generative phonology. In recent years, this approach has been applied successfully to a range of syntactic phenomena, and it is currently gaining popularity in semantics and pragmatics as well. It is based on the idea that a mapping from one level of linguistic representation to anothe...
متن کاملState Complexity of Regular Tree Languages for Tree Pattern Matching
We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2016
ISSN: 0362-5915,1557-4644
DOI: 10.1145/2898995